Maximum-size antichains in random set-systems
نویسندگان
چکیده
منابع مشابه
Maximum Antichains of Rectangular Arrays
Given a finite partially ordered set B, it is often of interest to describe the largest possible subsets SC B which consist of mutually incomparable elements of B. Such subsets are usually called maximum antichains or maximum Sperner families of .P after Sperner [I 51, who first characterized these maximum antichains in the case that 9 is a finite Boolean lattice, i.e., the set of all subsets o...
متن کاملMaximal Antichains of Minimum Size
Let n > 4 be a natural number, and let K be a set K ⊆ [n] := {1, 2, . . . , n}. We study the problem to find the smallest possible size of a maximal family A of subsets of [n] such that A contains only sets whose size is in K, and A 6⊆ B for all {A,B} ⊆ A, i.e. A is an antichain. We present a general construction of such antichains for sets K containing 2, but not 1. If 3 ∈ K our construction a...
متن کاملQuasi-random Set Systems
There are many properties of mathematical objects that satisfy what is sometimes called a 0-1 law, in the following sense. Under some natural probability measure on the set of objects, the measure of the subset of objects having the given property is either 0 or 1. In the latter case we can say that almost all the objects have the property. Familiar examples of this phenomenon are the following...
متن کاملFinding a Maximum Independent Set in a Sparse Random Graph
We consider the problem of finding a maximum independent set in a random graph. The random graphG is modelled as follows. Every edge is included independently with probability d n , where d is some sufficiently large constant. Thereafter, for some constant α, a subset I of αn vertices is chosen at random, and all edges within this subset are removed. In this model, the planted independent set I...
متن کاملMaximum graphs with unique minimum dominating set of size two
We prove that the maximum number of edges of a graph of order n which has a unique minimum dominating set of size two is bounded above by ( n−2 2 ) . As a corollary to this result, we prove a conjecture by Fischermann, Rautenbach and Volkmann that the maximum number of edges of a graph which has a unique minimum dominating set of size two is ( n−2 2 ) .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2016
ISSN: 1042-9832
DOI: 10.1002/rsa.20647